delay path中文什么意思

例句与用法

1. Another constrained problem is delay and delay variation constrained multicast routing problem . sp - dvma ( shortest path delay variation multicast algorithm ) algorithm based on minimum delay path is presented
   第二类是时延和时延差约束的多播路由问题，提出了以最短时延路径为基础的一种算法? ? sp - dvma算法。
2. This algorithm begins with yielding a least - cost spanning tree . then check every path from source to destination . if one path beyond the maximum delay , replace it with least - delay path in order to satisfying the delay bounded
   该算法在构造满足时延约束的组播树过程中,先构造最小生成树作为初始树,然后以时延最小路径代替树中的时延越界路径,直至树的根节点到所有目的节点的路径满足时延要求。
3. One of constrained problem is delay constrained steiner tree problem . a heuristic dbma ( delay - bounded multicast routing algorithm ) based on minimum delay path set and minimum cost path set is proposed . simulation result demonstrate that it is a delay constrained algorithm with low time complexity and low cost
   首先是时延约束的最小steiner树问题，在比较了现有的算法以后，提出了一种基于最短时延路径集和最小费用路径集的多播路由算法? ? dbma算法，仿真结果表明该算法是一种低复杂度的时延约束低费用多播路由算法。
4. The delay and delay variation constrained minimum steiner tree problem is also researched . lcdvma ( low - cost delay variation - constrained multicast algorithm ) is proposed for this problem . low time complexity , low cost and constrained delay and low delay variation are achieved by only comparing minimum delay paths and minimum cost paths
   对于时延和时延差约束的最小steiner树问题，提出了一种基于最小时延路径和最小费用路径的算法?一lcdvma算法，由于该算法比较了通过中转节点后的最低费用路径和最短时延路径，降低了运算复杂度，通过仿真得到了较小的网络费用和时延差，因此lcdvma算法是一种具有低复杂度的时延和时延差约束的最小steiner树的启发式算法。